On queueing problems in random-access communications
نویسنده
چکیده
The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main focus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random access schemes is discussed and a lower bound for the mean response time is conjectured.
منابع مشابه
A Queueing Network Model of a Circuit Switching Access Scheme in an Integrated Services Environment
A closed cyclic queueing system with multiple classes is analyzed numerically. The queueing system was originally motivated by a need to model circuit switching traffic in a data multiplexing scheme which provides both circuit and switching capabilities. The queueing system consists of two nodes, namely the primary and the secondary node. Customers in the primary node may require a random numbe...
متن کاملThe Quasi-Random Input Queueing System with Repeated Attempts as a Model for a CollisionŒAvoidance S - Communications, IEEE Transactions on
A performance model is developed and validated for a local area network (LAN) with a star topology. A collisionavoidance network access protocol, as implemented in Hubnet, is considered. The model is based on a single server queueing system with finite sources and with a single buffer. Packets arriving at a full buffer retry their access after a fixed time period. Results for an eight-node netw...
متن کاملOptimizing the Use of Random Access Channels in GSM-GPRS
The random access channels and traffic channels are utilized, respectively, for call establishment and information transmission in the uplink direction (from mobile to base station) of the Global System for Mobile communications (GSM) networks. A call is either rejected or blocked depending on its inability to succeed either in the random access channels or in the traffic channels. The optimum ...
متن کاملOn the Shannon capacity and queueing stability of random access multicast
We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for interference and allows for multipacket reception, we first characterize the Shannon capacity region. We then consider a queueing-theoretic formulation and char...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 1985